Type Inference and Subtyping for Higher-Order Generative Communication

نویسنده

  • Laurent Dami
چکیده

Models for generative communication use a common space, where concurrent agents put or retrieve data; data extraction is controlled by various kinds of filtering techniques, usually based on the structure of the data itself. However, for higher-order communication, i.e. when the data consists of software fragments, such techniques are not appropriate: structural information does not reflect the behaviour of a software fragment. This paper studies a filtering mechanism based instead on type information, so that software components can be retrieved according to type specifications. A rich type system with polymorphism and subtyping gives enough flexibility to formulate type specifications at various levels of detail.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Type Inference for the Mixture of Matching and Implicit Subtyping

We present a type inference system for a language with object-oriented features such as polymorphic record access and subtyping. We separate the notion of matching and subtyping in order to avoid di culties caused by recursive type constraints. We will use two kinds of type constraints | record (variant) constraints and subtyping constraints. Then, we discuss simpli cation of such mixed type co...

متن کامل

Session-Based Communication Optimisation for Higher-Order Mobile Processes

In this paper we solve an open problem posed in our previous work on asynchronous subtyping [12], extending the method to higher-order session communication and functions. Our system provides two complementary methods for communication code optimisation, mobile code and asynchronous permutation of session actions, within processes that utilise structured, typed communications. In order to prove...

متن کامل

Session typing and asynchronous subtyping for the higher-order π-calculus

This paper proposes a session typing system for the higher-order π-calculus(the HOπ-calculus) with asynchronous communication subtyping, which al-lows partial commutativity of actions in higher-order processes. The systemenables two complementary kinds of optimisation of communication code,mobile code and asynchronous permutation of session actions, within pro-cesses tha...

متن کامل

Global Principal Typing in Partially Commutative Asynchronous Sessions

We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal flexibility and safe optimisation in message choreography. A sound and complete algorithm for the subtyping relation, which can calculate conformance of optimised end-point processes to an agreed global specification, is p...

متن کامل

Optimal Representations of Polymorphic Types with Subtyping

Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed by eliminating quanti ed variables. Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables. We presen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008